Width-bounded geodesic strips for surface tiling

An analysis of electromagnetic scattering from finite-width strips

Deciding Clique-Width for Graphs of Bounded Tree-Width

We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta and Ioannis G. Tollis: submitted October 2001; revised July 2002 and February 2003. The work of the second author was supported by the German Research Association (DFG) grant WA 674/9-2. W. Espelage et al., Deciding Cli...

Bounded relational width

We prove that CSP(A) for an idempotent algebra A has bounded relational width if and only if var(A) omits the unary and affine types. If it has bounded relational width it has relational width at most 3. The problem, given a relational structure A, decide if CSP(A) has bounded relational width (equivalently, if the variety generated by the corresponding algebra omits the Boolean and affine type...

A Design Aid for Determining Width of Filter Strips

Watershed planners need a tool for determining width of filter strips that is accurate enough for developing cost-effective site designs and easy enough to use for making quick determinations on a large number and variety of sites. This study employed the process-based Vegetative Filter Strip Model to evaluate the relationship between filter strip width and trapping efficiency for sediment and ...

Tiling Rectangles and Half Strips with Congruent Polyominoes

Michael Reid Brown University February 23, 1996